Regularity of Splicing Languages

Splicing and Regularity

A Proof of Regularity for Finite Splicing

We present a new proof that languages generated by (non extended) H systems with finite sets of axioms and rules are regular.

Computational Modeling for Genetic Splicing Systems

A genetic splicing system involves DNA molecules mixed with enzymes and a ligase that allow the molecules to be cleaved and recombined to produce other molecules in addition to the original ones. Recently, using formal language theory, several researchers have investigated the string properties of DNA molecules that may potentially arise from the original set of molecules under the effect of th...

Linear and Circular Splicing Systems

We consider closure properties of classes of languages under the operation of iterated splicing. The main result is that full abstract families of languages are closed under splicing using a regular set of splicing rules. We have the same result for families of circular strings, with two extra assumptions: the languages in the abstract family must be closed under cyclic permutations and the spl...

1-splicing vs. 2-splicing: separating results

Splicing is a binary operation on strings defined by T. Head in 1987 which is inspired by the cut and paste phenomenon on DNA molecules [2]. Based on this operation, splicing systems, or H systems, were proposed as a generative device of languages: starting from a set of words, by repeated application of the splicing operation, new words may be generated. When we consider Păun’s definition, two...